More on Tame Dynamical Systems
نویسنده
چکیده
In this work, on the one hand, we survey and amplify old results concerning tame dynamical systems and, on the other, prove some new results and exhibit new examples of such systems. In particular, we study tame symbolic systems and establish a neat characterization of tame subshifts. We also provide sufficient conditions which ensure that certain coding functions are tame. Finally we discuss examples where certain universal dynamical systems associated with some Polish groups are tame.
منابع مشابه
Eventual Nonsensitivity and Tame Dynamical Systems
In this paper we characterize tame dynamical systems and functions in terms of eventual non-sensitivity and eventual fragmentability. As a notable application we obtain a neat characterization of tame subshifts X ⊂ {0, 1}Z: for every infinite subset L ⊆ Z there exists an infinite subset K ⊆ L such that πK(X) is a countable subset of {0, 1}K . The notion of eventual fragmentability is one of the...
متن کاملTrajectory length of the tame sweeping process
We show that bounded trajectories of the semi-algebraic, or more generally o-minimally definable, sweeping process have finite length. This result generalizes previous work on gradient/subgradient dynamical systems and paves the way for further extensions in control systems and mathematical mechanics.
متن کاملThe Structure of Tame Minimal Dynamical Systems
A dynamical version of the Bourgain-Fremlin-Talagrand dichotomy shows that the enveloping semigroup of a dynamical system is either very large and contains a topological copy of βN, or it is a “tame” topological space whose topology is determined by the convergence of sequences. In the latter case the dynamical system is called tame. We use the structure theory of minimal dynamical systems to s...
متن کاملSweeping by a tame process
We show that any semi-algebraic sweeping process admits piecewise absolutely continuous solutions, and any such bounded trajectory must have finite length. Analogous results hold more generally for sweeping processes definable in o-minimal structures. This extends previous work on (sub)gradient dynamical systems beyond monotone sweeping sets.
متن کاملOn Tame Dynamical Systems
A dynamical version of the Bourgain-Fremlin-Talagrand dichotomy shows that the enveloping semigroup of a dynamical system is either very large and contains a topological copy of βN, or it is a “tame” topological space whose topology is determined by the convergence of sequences. In the latter case we say that the dynamical system is tame. We show that (i) a metric distal minimal system is tame ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017